A decomposition theorem for biadditive processes

A Decomposition Theorem for Domains

A domain constructor that generalizes the product is de ned. It is shown that with this constructor exactly the prime-algebraic coherent Scott-domains and the empty set can be generated from two-chains and boolean at domains. 3 List of Symbols I am identifying the symbols by the corresponding Latex(+Amssymb)-symbols. " uparrow # downarrow ! rightarrow ? bot > top leq geq 2 in W bigvee V bigwedg...

Accelerated decomposition techniques for large discounted Markov decision processes

Many hierarchical techniques to solve large Markov decision processes (MDPs) are based on the partition of the state space into strongly connected components (SCCs) that can be classified into some levels. In each level, smaller problems named restricted MDPs are solved, and then these partial solutions are combined to obtain the global solution. In this paper, we first propose a novel algorith...

A Martingale Decomposition Theorem

A Cohomology Decomposition Theorem

In [9] Jackowski and McClure gave a homotopy decomposition theorem for the classifying space of a compact Lie group G; their theorem states that for any prime p the space BG can be constructed at p as the homotopy direct limit of a specific diagram involving the classifying spaces of centralizers of elementary abelian p-subgroups of G. In this paper we will prove a parallel algebraic decomposit...

A Decomposition Theorem for Herman Maps

In 1980s, Thurston established a topological characterization theorem for postcritically finite rational maps. In this paper, a decomposition theorem for a class of postcritically infinite branched covering termed ‘Herman map’ is developed. It’s shown that every Herman map can be decomposed along a stable multicurve into finitely many Siegel maps and Thurston maps, such that the combinations an...